Package | Description |
---|---|
oracle.pgx.api |
This package contains the Java APIs of PGX.
|
Modifier and Type | Method and Description |
---|---|
<ID extends Comparable<ID>> |
Analyst.hits(PgxGraph graph, int max)
Blocking version of
#hitsAsync() . |
<ID extends Comparable<ID>> |
Analyst.partitionConductance(PgxGraph graph, Partition<ID> components)
Blocking version of
#partitionConductanceAsync() . |
<ID extends Comparable<ID>> |
Analyst.salsa(BipartiteGraph graph, int k)
Blocking version of
Analyst.salsaAsync(BipartiteGraph, int) . |
<ID extends Comparable<ID>> |
Analyst.salsa(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter)
Blocking version of
Analyst.salsaAsync(BipartiteGraph, int, double, double, int) . |
<ID extends Comparable<ID>> |
Analyst.whomToFollow(PgxGraph graph, ID vertexId, int max)
Convenience wrapper around
Analyst.whomToFollow(PgxGraph, PgxVertex, int) taking a vertex ID instead of a PgxVertex . |
<ID extends Comparable<ID>> |
Analyst.whomToFollow(PgxGraph graph, ID vertexId, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)
Convenience wrapper around
Analyst.whomToFollow(PgxGraph, PgxVertex, int, int, int, double, double, int, double) taking a vertex ID instead of a PgxVertex . |
<ID extends Comparable<ID>> |
Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max)
Blocking version of
Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int) . |
<ID extends Comparable<ID>> |
Analyst.whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)
|
Modifier and Type | Method and Description |
---|---|
<ID extends Comparable<ID>> |
Analyst.hitsAsync(PgxGraph graph, int max)
Classic HITS algorithm (Hyperlink-Induced Topic Search, aka.
|
<ID extends Comparable<ID>> |
Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition)
Compute the conductance of a partition.
|
<ID extends Comparable<ID>> |
Analyst.salsaAsync(BipartiteGraph graph, int k)
Convenience method around
Analyst.salsaAsync(BipartiteGraph, int, double, double, int) using maxDiff = 0.01 d = 0.85 maxIter = 1000 |
<ID extends Comparable<ID>> |
Analyst.salsaAsync(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter)
SALSA recommendation algorithm.
|
<ID extends Comparable<ID>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max)
Convenience method around
Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double) using circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01 |
<ID extends Comparable<ID>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)
The Who to Follow recommendation algorithm by Twitter, Inc.
|
Copyright © 2015. All rights reserved.